Compiling constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Compiling constraint satisfaction problems
Many tasks requiring intelligence, in particular scheduling and planning, must be solved under time constraints. This is diicult to achieve because of the combinato-rial nature of such tasks. While search heuristics can give good average performance, they cannot give any peformance guarantees for a particular instance. Fortunately, the tasks are often very similar. Therefore, compiling partial ...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملStrategic Constraint Satisfaction Problems
The Quantified constraint satisfaction problem (QCSP) has been introduced to express situations in which we are not able to decide the value of some of the variables (the universal ones). Despite the expressiveness of QCSP, many problems, such as two-player games or motion planning of robots, remain difficult to express. In this paper, we propose Strategic CSP, an extension of QCSP where univer...
متن کاملDistance Constraint Satisfaction Problems
We study the complexity of constraint satisfaction problems for templates Γ that are firstorder definable in (Z; succ), the integers with the successor relation. In the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree), we show that Γ is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and the CSP for Γ ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00077-6